Inverse subspace bi-iteration and bi-Newton methods for computing spectral projectors
نویسندگان
چکیده
منابع مشابه
Inverse Subspace Iteration for Spectral Stochastic Finite Element Methods
We study random eigenvalue problems in the context of spectral stochastic finite elements. In particular, given a parameter-dependent, symmetric positive-definite matrix operator, we explore the performance of algorithms for computing its eigenvalues and eigenvectors represented using polynomial chaos expansions. We formulate a version of stochastic inverse subspace iteration, which is based on...
متن کاملBi-iteration recursive instrumental variable subspace tracking and adaptive filtering
In this paper, we propose a class of fast sequential bi-iteration singular value (Bi-SVD) subspace tracking algorithms for adaptive eigendecomposition of the cross covariance matrix in the recursive instrumental variable (RIV) method of system identification. These algorithms can be used for RIV subspace processing of signals in unknown correlated Gaussian noise. Realizations with O(Nr) and O(N...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملRecursive bi-orthogonalisation approach and orthogonal projectors
An approach is proposed which, given a family of linearly independent functions, constructs the appropriate bi-orthogonal set so as to represent the orthogonal projector operator onto the corresponding subspace. The procedure evolves iteratively and it is endowed with the following properties: i) it yields the desired bi-orthogonal functions avoiding the need of inverse operations ii) it allows...
متن کاملa new inexact inverse subspace iteration for generalized eigenvalue problems
in this paper, we represent an inexact inverse subspace iteration method for com- puting a few eigenpairs of the generalized eigenvalue problem ax = bx[q. ye and p. zhang, inexact inverse subspace iteration for generalized eigenvalue problems, linear algebra and its application, 434 (2011) 1697-1715 ]. in particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2015
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2015.02.002